Route optimization using star-mesh hybrid topology in localized dense ad-hoc networks

ABSTRACT

Optimized routing in localized dense networks is provided. A packet is received at a first network device in a network. An optimal route for the packet to a neighbor network device in the network is determined using a Source Routing Table (SRT), wherein the SRT includes an optimized routing table and a standard routing table, and wherein the optimized routing table comprises a list of neighbor network devices that the first network device can route to directly and wherein the standard routing table comprises a ZigBee source routing table. The packet is routed using the optimal route.

CROSS-REFERENCE TO RELATED APPLICATION

The present application claims the benefit of, and priority to, U.S. Provisional Application No. 62/232,699, entitled “OPTIMIZED ROUTING IN LOCALIZED DENSE NETWORKS” and filed Sep. 25, 2015, the entire contents of which are hereby incorporated by reference.

TECHNICAL FIELD

The present invention relates to networks, and more specifically, to optimizing routing in localized mesh networks having a large number of network devices.

BACKGROUND

ZigBee is a low-cost, low-power, wireless mesh network standard targeted at the wide development of long battery life devices in wireless control and monitoring applications. ZigBee devices have low latency, which further reduces average current. ZigBee chips are typically integrated with radios and with microcontrollers that have some amount of memory, currently typically between 60-256 KB of flash memory. ZigBee operates in the industrial, scientific, and medical (ISM) radio bands. The ZigBee network layer natively supports generic mesh networking. Every network must have one coordinator device, tasked with its creation, the control of its parameters, and basic maintenance.

In a wireless mesh network, such as but not limited to a ZigBee wireless network, a message (or packet) is routed from one node to another node using intermediary nodes. This is normally done when the two end nodes are not in radio range of one another, but all of the intermediary nodes and the end nodes in the chain are in radio range of the previous and the next node in the chain. Each time the packet is forwarded to the next node in the chain, this is a hop. In theory, using meshing, any node may talk to any other node in the ZigBee network, but often all nodes will talk to just one node and that one node will talk back to them. In such a configuration, the one node through which all traffic flows is the concentrator, and ZigBee has special allowances for this type of configuration. In this configuration, communication may be made to be more efficient through a mechanism called source routing. Essentially, all the non-concentrator nodes just need to know how to route a packet back to the concentrator. (In actuality, each node only knows the next node in the route to get back to the concentrator, and that next node knows its next node, and so on). The concentrator, however, needs to know the route to every single device on the network, and it needs to know the entire route. This puts most of the onus on the concentrator, which usually needs to be more intelligent and have more resources (memory, processing, communication, etc.) as a result.

The way the routes are formed in this configuration is that each node keeps track of its neighbors (devices within radio range) using its neighbor table and by listening to special types of messages called Link Status messages. These messages are not re-transmitted, so if a node hears one, it knows that it is in radio range of the device that sent the Link Status message. Periodically an MTORR (Many-to-One Route Request) packet or message is broadcast by the concentrator throughout the network. Devices build up their route back to the concentrator by using their neighbor tables and the propagation of the MTORR packet or message (routing cost back to the concentrator gets written to it by devices as it is re-broadcasted). Thus, Device A needs to be in Device B's neighbor table in order for Device A to route directly to Device B (and vice-versa).

SUMMARY

Conventional routing environments, such as those explained above, suffer from a variety of deficiencies. In ZigBee, there is a strict limitation of sixteen on the neighbor table size. This limits the number of direct hops to the concentrator, despite being in direct radio range. This is due to packet size limitations of the Link Status message. This normally is not a problem, except in a dense network where a device may have far more than sixteen neighbors. What may happen in this case, referring to FIG. 1, is that Device A may not be in Device B's neighbor table, even though it's within radio range. Device A may have to route through Device D, or even Device C and Device D, to get to Device B. Device A may be the concentrator (or even some node through which the concentrator may talk to B), meaning the concentrator may easily talk directly to Device B, but instead has to route through 2 other devices to get there (i.e., 3 hops instead of 1). The same is true when Device B is talking to Device A, which takes the same 3-hop path, just in reverse. Due to limitations in a ZigBee routing table, in a dense network with a lot of nodes, standard ZigBee routing may force a message to traverse an indirect path with a lot of hops, while a more direct path with fewer hops would have sufficed. The mesh topology provides inherent tolerance to broken links, at the expense of bandwidth, as the number of packets (request and response) increase proportionally to the number of hops along a single path. Given the complexity of a system that may be adopted, this may be infeasible in applications with higher throughput demands.

Embodiments provide systems and methods such that direct links (favored for routing) from a network concentrator can be found and maintained sustainably, while retaining the underlying repair mechanism of a wireless mesh network. Embodiments accomplish this by defining routes using a prioritized star network for specifically optimized one-hop routing to destination and/or intermediate nodes, then bridging down into the standard AODV multi-hop network to reach all remaining nodes if need be. Embodiments thus provide for routing of packets in a dense network that is more efficient, and uses less bandwidth for any given packet. This allows more packets to be sent per second, increasing the responsiveness of a ZigBee-based system and allowing more information to flow through the network. Embodiments provide optimized source routing that determines if a more direct route is available, and employs that route by overriding the standard ZigBee Source Route. Such embodiments for optimized routing in localized dense networks are particularly applicable to networks used for advanced systems, such as but not limited to advanced building automation system, advanced energy management systems, and advanced lighting systems. For example, in an advanced lighting system, each node may be either a lighting device or a sensor, and is equipped with a radio for communication with other nodes of the network.

Some embodiments disclosed herein include software programs to perform the method embodiment steps and operations summarized above and disclosed in detail below. More particularly, some embodiments includes a computer program product that has a non-transitory computer-readable medium including computer program logic encoded thereon, that when performed in a computerized device such as a processor, provides associated operations to optimize routing in localized dense networks as explained herein. The computer program logic, when executed on at least one processor with a computing system, causes the processor to perform the operations (e.g., the methods) indicated herein. Such embodiments are typically provided as software, code, and/or other data structures arranged or encoded on a computer readable medium such as but not limited to an optical medium (e.g., CD-ROM, DVD-ROM, Blu-Ray), hard disk, solid state memory, or on another medium, such as but not limited to firmware or microcode in one or more ROM or RAM or PROM chips, or as an Application Specific Integrated Circuit (ASIC) or as downloadable software images in one or more modules, shared libraries, etc. The software or firmware or other such configurations may be installed onto a computerized device to cause one or more processors in the computerized device to perform the techniques explained herein. Software processes that operate in a collection of computerized devices, such as in a group of data communications devices or other entities, are also included. Embodiments may be distributed between many software processes on several data communications devices, or all processes could run on a small set of dedicated computers or processor, or on one computer or processor alone.

In an embodiment, there is provided a method. The method includes: receiving a packet at a first network device in a network; determining an optimal route for the packet to a neighbor network device in the network using a Source Routing Table (SRT), wherein the SRT includes an optimized routing table and a standard routing table; and routing the packet to the neighbor network device using the optimal route.

In a related embodiment, determining may include: determining an optimal route for the packet to a neighbor network device in the network using a Source Routing Table (SRT), wherein the SRT includes an optimized routing table and a standard routing table, wherein the optimized routing table comprises a list of neighbor network devices that the first network device can route to directly, and wherein the standard routing table comprises a ZigBee source routing table.

In another related embodiment, the method may further include maintaining the SRT.

In a further related embodiment, maintaining the SRT may include: determining whether a route in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops using a one-hop optimized route; when sending a test packet fails, canceling a maintaining process for the route; and when sending a test packet succeeds, resending the test packet directly to the neighbor network device with no intermediary hops a predetermined number of times at predetermined intervals, such that if the resending is successful each time, routing all future non-test packets to the neighbor network device using the one-hop optimized route.

In another further related embodiment, maintaining the SRT may include: determining whether a route in the SRT is one-hop optimized; when the route is determined to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops; when sending a test packet succeeds, canceling a maintaining process for the route; and when sending a test packet is not successful, setting the route as not one-hop optimized and routing all future non-test packets to the neighbor network device using the standard routing table of the SRT.

In yet another further related embodiment, maintaining the SRT may include: determining whether a route to or from a concentrator in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, determining whether the concentrator is in a neighbor table and whether a link quality of a link to the concentrator is good; when the concentrator is either not in a neighbor table or a link quality is not good, repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval; when the concentrator is either in a neighbor table or a link quality is good, sending a test packet directly to the concentrator with no intermediary hops; when sending a test packet is not successful, canceling a maintaining process for the route; and when sending a test packet is successful, sending again a predetermined number of times, and if all are successful, setting the route as one-hop optimized and routing all future non-test packets to the concentrator using the one-hop optimized routing table of the SRT. IN a further related embodiment, when the route is determined to be one-hop optimized, and a link quality is good, sending a predetermined number of test packets to or from the concentrator; when sending a test packet succeeds, canceling a maintaining process for the route; when sending a test packet is not successful, then setting the route as not one-hop optimized and routing all future non-test packets to or from the concentrator using the standard routing table of the SRT; and when the route is determined to be one-hop optimized and a link quality is not good, then repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval.

In another embodiment, there is provided a computer program product, stored on a non-transitory computer readable medium, including instructions of optimized routing in localized dense networks that, when executed on a processor in communication with the non-transitory computer readable medium, cause the processor to perform operations of: receiving a packet at a first network device in a network; determining an optimal route for the packet to a neighbor network device in the network using a Source Routing Table (SRT) wherein the SRT includes an optimized routing table and a standard routing table; and routing the packet using the optimal route.

In a related embodiment, the instructions may cause the processor to perform further operations of: determining an optimal route for the packet to a neighbor network device in the network using a Source Routing Table (SRT), wherein the SRT includes an optimized routing table and a standard routing table, wherein the optimized routing table comprises a list of neighbor network devices that the first network device can route to directly, and wherein the standard routing table comprises a ZigBee source routing table.

In another related embodiment, the instructions may cause the processor to perform further operations of maintaining the SRT.

In a further related embodiment, the instructions for maintaining the SRT may cause the processor to perform further operations of: determining whether a route in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops using a one-hop optimized route; when sending a test packet fails, canceling a maintaining process for the route; and when sending a test packet is successful, resending the test packet directly to the neighbor network device with no intermediary hops a predetermined number of times at predetermined intervals, such that if the resending is successful each time, routing all future non-test packets to the neighbor network device using the one-hop optimized route.

In another further related embodiment, the instructions for maintaining the SRT may cause the processor to perform further operations of: determining whether a route in the SRT is one-hop optimized; when the route is determined to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops; when sending a test packet succeeds, canceling a maintaining process for the route; and when sending a test packet is not successful, setting the route as not one-hop optimized and routing all future non-test packets to the neighbor network device using the standard routing table of the SRT.

In still another further related embodiment, the instructions for maintaining the SRT may cause the processor to perform further operations of: determining whether a route to or from a concentrator in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, determining whether the concentrator is in a neighbor table and whether a link quality of a link to the concentrator is good; when the concentrator is either not in a neighbor table or a link quality is not good, repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval; when the concentrator is either in a neighbor table or a link quality is good, sending a test packet directly to the concentrator with no intermediary hops; when sending a test packet is not successful, canceling a maintaining process for the route; and when sending a test packet is successful, sending again a predetermined number of times, and if all are successful, setting the route as one-hop optimized and routing all future non-test packets to the concentrator using the one-hop optimized routing table of the SRT. In a further related embodiment, the instructions may cause the processor to perform further operations of: when the route is determined to be one-hop optimized, and wherein a link quality is good, sending a predetermined number of test packets to or from the concentrator; when sending a test packet succeeds, canceling a maintaining process for the route; when sending a test packet is not successful, then setting the route as not one-hop optimized and routing all future non-test packets to or from the concentrator using the standard routing table of the SRT; and when the route is determined to be one-hop optimized and a link quality is not good, then repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval.

In another embodiment, there is provided a network device. The network device includes: a memory; a processor; a communications interface; and an interconnection mechanism coupling the memory, the processor, and the communications interface; wherein the memory is encoded with an application to optimize routing in localized dense networks, that when performed on the processor, provides a process to optimize routing in localized dense networks, the process causing the network device to perform operations of: receiving a packet at a first network device in a network; determining an optimal route for the packet to a neighbor network device in the network using a Source Routing Table (SRT) wherein the SRT includes an optimized routing table and a standard routing table; and routing the packet to the neighbor network device using the optimal route.

In a related embodiment, the optimized routing table may include a list of neighbor network devices that the first network device can route to directly, and the standard routing table may include a ZigBee source routing table.

In another related embodiment, the network device may further include operations of maintaining the SRT. In a further related embodiment, maintaining the SRT may include: determining whether a route in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops using a one-hop optimized route; when sending a test packet fails, canceling a maintaining process for the route; and when sending a test packet is successful, resending the test packet directly to the neighbor network device with no intermediary hops a predetermined number of times at predetermined intervals, such that if the resending is successful each time, routing all future non-test packets to the neighbor network device using the one-hop optimized route.

In another further related embodiment, maintaining the SRT may include: determining whether a route in the SRT is one-hop optimized; when the route is determined to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops; when sending a test packet succeeds, canceling a maintaining process for the route; and when sending a test packet is not successful, setting the route as not one-hop optimized and routing all future non-test packets to the neighbor network device using the standard routing table of the SRT.

In yet another further related embodiment, maintaining the SRT may include: determining whether a route to or from a concentrator in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, determining whether the concentrator is in a neighbor table and whether a link quality of a link to the concentrator is good; when the concentrator is either not in a neighbor table or a link quality is not good, repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval; when the concentrator is either in a neighbor table or a link quality is good, sending a test packet directly to the concentrator with no intermediary hops; when sending a test packet is not successful, canceling a maintaining process for the route; and when sending a test packet is successful, sending again a predetermined number of times, and if all are successful, setting the route as one-hop optimized and routing all future non-test packets to the concentrator using the one-hop optimized routing table of the SRT. In a further related embodiment, the network device may further include operations of: when the route is determined to be one-hop optimized, and wherein a link quality is good, sending a predetermined number of test packets to or from the concentrator; when sending a test packet succeeds, canceling a maintaining process for the route; when sending a test packet is not successful, then setting the route as not one-hop optimized and routing all future non-test packets to or from the concentrator using the standard routing table of the SRT; and when the route is determined to be one-hop optimized and a link quality is not good, then repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing and other objects, features and advantages disclosed herein will be apparent from the following description of particular embodiments disclosed herein, as illustrated in the accompanying drawings in which like reference characters refer to the same parts throughout the different views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles disclosed herein.

FIG. 1 depicts a block diagram of a prior art environment for optimized routing in localized dense networks.

FIG. 2 depicts a block diagram of an environment for optimized routing in localized dense networks according to embodiments disclosed herein.

FIGS. 3A-3C depict a flow diagram of a method of optimizing routing in localized dense networks according to embodiments disclosed herein.

FIG. 4 depicts a block diagram of a network device according to embodiments disclosed herein.

DETAILED DESCRIPTION

FIG. 1 shows a first environment 10. Device A is a concentrator. The solid line shows the path taken by a packet from Device A to Device B. The path includes multiple hops, a first hop from Device A to Device C, a second hop from Device C to Device D, and a third hop from Device D to Device B. This wastes bandwidth and adds delay. This occurs when the network is dense and the standard ZigBee neighbor tables of Device A and/or Device B are full and therefore there is not a one-hop path available in the standard ZigBee Source Routing Table from Device A to Device B. The dotted line shows the desired direct path from Device A to Device B.

Embodiments include keeping track of incoming route information from devices (via Route Record packets and by routes taken by test packets), and maintaining a device's own Source Routing Table (as opposed to the standard ZigBee Source Routing Table provided by the ZigBee stack). This device-specific Source Routing Table contains both optimized source routes and standard ZigBee source routes, in case an optimized route is not available or as a fallback in case an optimized route stopped working. Some embodiments use different ways to determine if a more optimized route is available. For example, in some embodiments, the neighbor table is periodically updated and it only contains devices that are within radio range. By periodically scanning this table and maintaining a table of devices that have existed (or currently exist) in the neighbor table, a device may get an idea of other devices that may be reached directly. In some embodiments, a trial and error methodology is used. A test packet is sent by a device using a path that it believes could be more optimal. If it succeeds then it knows that the optimized path may be used. If it fails, then it either tries a different route, or gives up and accepts that for that particular node, a more optimized path doesn't exist. Also, it may further improve this by leveraging the fact that all source routes essentially form a tree, and that if an optimized route is found for a node that is an intermediary node of another route, then the optimized route may be used for that other route as well. For example, FIG. 2 show a network environment 50 including Device A, which is the concentrator, Device B, Device C, and Device D. Device A is connected to Device B, which is connected to Device C, which is connected to Device D. In the network environment 50, if it is discovered that Device A is able to communicate to Device C directly (as opposed to routing through Device B), then a packet to Device D may also be sent by bypassing Device B. Using standard ZigBee source routing, the path from A to C would have been A→B→C and the path from A to D would have been A→B→C→D. With optimized source routing according to embodiments disclosed throughout, the path from A to C would instead be A→C and the path from A to Do would instead be A→C→D. Thus, optimizing one of these routes may automatically optimize another route, because they share the same base path. These approaches, in some embodiments, are applied separately, and in some embodiments, are applied together to increase the likelihood of success and increase the reliability of the optimized network.

In a wireless system, a route that previously worked may stop working, and a route that did not work previously may work in the future. This is because the quality of a link between two nodes is determined by many factors, many of which are constantly changing. For this reason, even standard ZigBee routing is quite dynamic and often has to be updated periodically to maintain a reliable network. With optimized routing, this is also true. Routes that previously failed need to be tried again in case they start working, and existing optimized routes should be re-validated to ensure they still work. Overriding the standard ZigBee source route is a relatively straightforward process, because the entire source route is contained in the “ZigBee Network” portion of the packet. The packet will then be forwarded along the specified path without any further intervention needed.

In some embodiments, such as those used to source route from the concentrator to a node, the following methodology is used. In a round robin format, the concentrator continuously performs an optimization attempt process on all known routers in a network. The optimization attempt process for each router starts by checking to see if the route in the source route table is set to be one-hop optimized (i.e., it is currently communicating directly to the router). If the route is not one-hop optimized, the concentrator tries sending a test packet (which is considered acceptable to lose) directly to the router with no intermediary hops (one-hop source routed). If the test packet fails (i.e., the test packet is not received by router, for example there is no APS ack and/or MAC ack received from the router, or the number of MAC retries is greater than or equal to some threshold, such as but not limited to seven), nothing is done and the optimization attempt process is cancelled. One-hop optimized routing to that router is then immediately disabled. If the test packet succeeds (i.e., the test packet is received by the router, for example there is an APS ack and/or MAC ack received from the router, or the number of MAC retries is less than the threshold), this is considered to be a successful attempt. When there are some number of consecutive successful attempts, such as two, three, four, five, six, and so on, and these are separated by at least a minimum time period, such as three minutes, four minutes, five minutes, six minutes, and so on, for that router, it is determined that the route to that router should be one-hop optimized and immediately all subsequent routing of non-test packets to-and-through the router are routed along the newly found path. Therefore, this automatically optimizes the route.

Referring again to FIG. 2, if communication from Device A to Device C is not using a one-hop optimized route, and Device A successfully sends three one-hop source routed test packets to Device C, then all future non-test packets from Device A to Device C will be sent directly (A→C) and all future non-test packets to Device D will be sent using the route A→C→D. Note that the newly optimized route automatically benefits all other mesh network devices down its path, be they end devices or other routers, as packets will take the initial one-hop route to the intermediate router before continuing on the path towards the destination. It should be appreciated that the example numbers used above (for example, seven MAC retries, three, four, five, or six attempts, and three, four, five, or six minutes) are only for a specific example and that any number of MAC retries, any number of attempts, and any number of minutes or seconds could be used.

If, at the start of the optimization attempt process, the route in the source route table is already set to be one-hop optimized, the concentrator instead uses the opportunity to validate the one-hop optimized route. If the one-hop source routed test packet succeeds (i.e., the packet is received by the router (APS ack and/or MAC ack received from the router) and the number of MAC retries is beyond the set threshold), nothing is done, but if it fails (i.e., no APS ack and/or MAC ack received from the router, or the number of MAC retries is beyond the set threshold), the route is set to not be one-hop optimized and all routing of non-test packets to this router will instead be reached via standard ZigBee source routing.

In some embodiments, such as used to source route from a router to a concentrator, the following methodology is used. The optimization attempt process is started by a router by checking to see if the route to the concentrator is set to be one-hop optimized. If it is not set to be one-hop optimized, it proceeds by checking to see if the concentrator is in its neighbor table and that the link quality is good. If it is not in the neighbor table or if the link quality is not good, then the route remains as not one-hop optimized and the optimization attempt process is restarted after some amount of time, such as but not limited to 15 minutes, 10 minutes, 20 minutes, 11 minutes, 16 minutes, 14 minutes, and so on.

If the concentrator is in the neighbor table of the router and its link quality is deemed good, then the router attempts to send one-hop source routed test packets to the concentrator (which are considered acceptable to lose). It sends a number of test packets, such as but not limited to 2, 3, 4, 5, and so on, spaced some amount of time apart, for example but not limited to 5 seconds, 4 seconds, 4.5 seconds, 6 seconds, 5.5 seconds, and so on. If at any point a test packet fails (i.e., the test packet is not received by the concentrator (no APS ack and/or MAC ack received from the concentrator)), the route to the concentrator remains as not one-hop optimized and the optimization attempt process is restarted after a period of time, such as but not limited to 15 minutes, 10 minutes, 20 minutes, 11 minutes, 16 minutes, 14 minutes, and so on. If all sent test packets succeed (all test packets are received by the concentrator (APS acknowledgements and/or MAC acknowledgments received from the concentrator for all test packets)), then the route to the concentrator is set as one-hop optimized. At that point in time, all non-test packets will be routed directly to the concentrator without any intermediary hops.

If, at the start of the optimization attempt process, the route to the concentrator is already set to be one-hop optimized, the route is re-tested by sending a test packet. If the test packet succeeds, the optimization attempt process is restarted after a period of time. If the test packet fails, the route is set to not be one-hop optimized. All non-test packets to the concentrator will be routed using standard ZigBee routing at that point in time, and the optimization attempt process is restarted after a period of time. In addition to the optimization attempt process, if ever the link quality for the concentrator in the neighbor table changes from good to bad, or if ever the concentrator disappears from a non-full neighbor table (indicating it is no longer in wireless range), the route is also set to not be one-hop optimized. Although the above process is applied to the route to the concentrator, it may just as easily be applied to any other node on the ZigBee network.

In some embodiments, the network is defined to be less dense (i.e., more sparse). In a ZigBee network, devices may be divided into either routers or end devices. Usually routers are line-powered devices, because routing is an energy-taxing service as a device always needs to be listening and often transmitting messages throughout the network. Usually end devices are called sleepy end devices, and they are usually battery powered devices that do not take part in the routing of messages to other devices. End devices need to have a router as a parent. The router parent stores messages for the device while it is sleeping, and acts as a proxy towards the ZigBee network. It is, however, possible to be a non-sleepy end device, which is a line-powered device that does not actively take part in the routing of messages throughout the network. Some of the routers are decreed to be non-sleepy end devices, and then they will not be seen in the neighbor tables of routers, nor actively participate in the routing of packets. When forming the source routes to and from the concentrator then, there are a fewer number of routers, and hence the neighbor tables of routers are not constantly overflowing. This allows a more direct and efficient path to be to be used when devices are communicating to/from the concentrator.

There are a variety of ways to select which routers to decree as end devices. For example, routers may be randomly picked, however this may alienate a certain portion of the network because there are no more routers in that region. Also, when a device is an end device, it needs to be in the parent table of a router. This could lead to a situation in a portion of the network where there are too many end devices to be contained in the child tables of routers nearby. Such child tables could then be expanded.

A flow diagram of a method 100 is depicted in FIGS. 3A-3C. The rectangular elements are herein denoted “processing blocks” and represent computer software instructions or groups of instructions. Alternatively, the processing blocks represent steps performed by functionally equivalent circuits, such as a digital signal processor circuit or an application specific integrated circuit (ASIC).

The flow diagrams of FIGS. 3A-3C do not depict the syntax of any particular programming language. Rather, the flow diagrams illustrate the functional information one of ordinary skill in the art requires to fabricate circuits or to generate computer software to perform the processing required in accordance with the present invention. It should be noted that many routine program elements, such as initialization of loops and variables, and the use of temporary variables, are not shown. It will be appreciated by those of ordinary skill in the art that unless otherwise indicated herein, the particular sequence of steps described is illustrative only and may be varied without departing from the spirit of the invention. Thus, unless otherwise stated, the steps described below are unordered meaning that, when possible, the steps may be performed in any convenient or desirable order.

Further, while FIGS. 3A-3C illustrate various operations, it is to be understood that not all of the operations depicted in FIGS. 3A-3C are necessary for other embodiments to function. Indeed, it is fully contemplated herein that in other embodiments, the operations depicted in FIGS. 3A-3C, and/or other operations described herein, may be combined in a manner not specifically shown in any of the drawings, but still fully consistent with the present disclosure. Thus, claims directed to features and/or operations that are not exactly shown in one drawing are deemed within the scope and content of the present disclosure.

The method 100 begins in FIG. 3A with a processing block 102, a packet is received at a first network device in a network. In a processing block 104, an optimal route for the packet to a neighbor network device in the network is determined using a Source Routing Table (SRT), wherein the SRT includes an optimized routing table and a standard routing table. As shown in a processing block 106, in some embodiments, the optimized routing table comprises a list of neighbor network devices that the first network device can route to directly, and the standard routing table comprises a ZigBee source routing table. Next, in a processing block 108, the packet is routed using the optimal route. The optimal route, in some embodiments, is the route from the optimized routing table, and in some embodiments, is a route from the ZigBee source routing table.

Processing continues in FIG. 3B with a processing block 110, where the SRT is maintained. In some embodiments, as shown in a processing block 112, the SRT is maintained by determining whether a route in the SRT is one-hop optimized. In some embodiments, as shown in a processing block 114, when the route is determined not to be one-hop optimized, then a test packet is sent directly to the neighbor network device with no intermediary hops using a one-hop optimized route. Then, in a processing block 116, when sending the test packet fails, a maintaining process for the route is canceled. In a processing block 118, when sending the test packet is successful, then the test packet is resent directly to the neighbor network device with no intermediary hops a predetermined number of times at predetermined intervals, and if the resending is successful each time, then all future non-test packets are routed to the neighbor network device using the one-hop optimized route.

In some embodiments, as shown in a processing block 120, when the route is determined to be one-hop optimized, a test packet is sent directly to the neighbor network device with no intermediary hops. In a processing block 122, when sending a test packet succeeds, then a maintaining process for the route is canceled. In a processing block 124, when sending a test packet is not successful, then the route is set as not one-hop optimized and all future non-test packets are routed to the neighbor network device using the standard routing table of the SRT.

Processing continues in FIG. 3C with a processing block 126, where whether a route to or from a concentrator in the SRT is one-hop optimized is determined. In a processing block 128, when the route is determined not to be one-hop optimized, then it is determined whether the concentrator is in a neighbor table and whether a link quality of a link to the intended device is good. In some embodiments, as shown in a processing block 130, when the concentrator is either not in a neighbor table or a link quality is not good, then determining whether a route to or from the concentrator in the SRT is one-hop optimized is repeated after a predetermined time interval. In a processing block 132, when the concentrator is either in a neighbor table or a link quality is good, then a test packet is sent directly to the concentrator with no intermediary hops. In a processing block 134, when sending the test packet succeeds, then a maintaining process for the route is canceled. In a processing block 136, when sending the test packet is not successful, then the route is set as not one-hop optimized and all future non-test packets are routed to the concentrator using the standard routing table of the SRT.

In some embodiments, as shown in a processing block 138, when the route is determined to be one-hop optimized and wherein a link quality is good, then a predetermined number of test packets are sent to or from the concentrator. In a processing block 140, when sending the test packet is successful, then a maintaining process for the route is canceled. In a processing block 142, when sending the test packet is not successful, then the route is set as not one-hop optimized and all future non-test packets are routed to or from the concentrator using the standard routing table of the SRT. In a processing block 144, when the route is determined to be one-hop optimized and wherein a link quality is not good, then determining whether a route to or from a concentrator in the SRT is one-hop optimized is repeated after a predetermined time interval.

Referring now to FIG. 4, a block diagram 200 illustrates an example architecture of a network device 210 that executes, runs, interprets, operates, or otherwise performs an optimized routing application 240-1 and an optimized routing process 240-2 suitable for use in explaining example configurations disclosed herein. As shown in FIG. 4, the network device 210 includes an interconnection mechanism 211, such as but not limited to a data bus or other circuitry that couples a memory 212, a processor 213, an input/output interface 214, and a communications interface 215. In some embodiments, the input/output interface 214 is optional. The communications interface 215 enables the network device 210 to communicate with other devices (i.e., other network devices) on a network (not shown).

The memory 212 is any type of computer readable medium, and in this example, is encoded with an optimized routing application 240-1 as explained herein. The optimized routing application 240-1 may be embodied as software code such as data and/or logic instructions (e.g., code stored in the memory or on another computer readable medium such as a removable disk) that supports processing functionality according to different embodiments described herein. During operation of the network device 210, the processor 213 accesses the memory 212 via the interconnection mechanism 211 in order to launch, run, execute, interpret, or otherwise perform the logic instructions of the optimized routing application 240-1. Execution of the optimized routing application 240-1 in this manner produces processing functionality in the optimized routing process 240-2. In other words, the optimized routing process 240-2 represents one or more portions or runtime instances of an optimized routing application 240-1 (or the entire optimized routing application 240-1) performing or executing within or upon the processor 213 in the network device 210 at runtime.

It is noted that example configurations disclosed herein include the optimized routing application 240-1 itself (i.e., in the form of un-executed or non-performing logic instructions and/or data). The optimized routing application 240-1 may be, and in some embodiments is, stored on a computer readable medium such as a disk, hard drive, electronic, magnetic, optical, or other computer readable medium. The optimized routing application 240-1 may also be, and in some embodiments is, stored in a memory 212, such as in firmware, read only memory (ROM), or as executable code in, for example, Random Access Memory (RAM). In addition to these embodiments, it should also be noted that other embodiments herein include the execution of the optimized routing application 240-1 in the processor 213 as the optimized routing process 240-2. Those skilled in the art will understand that the network device 210 may include other processes and/or software and hardware components, such as an operating system that controls allocation and use of hardware resources associated with the network device 210, not shown in this example.

The methods and systems described herein are not limited to a particular hardware or software configuration, and may find applicability in many computing or processing environments. The methods and systems may be implemented in hardware or software, or a combination of hardware and software. The methods and systems may be implemented in one or more computer programs, where a computer program may be understood to include one or more processor executable instructions. The computer program(s) may execute on one or more programmable processors, and may be stored on one or more storage medium readable by the processor (including volatile and non-volatile memory and/or storage elements), one or more input devices, and/or one or more output devices. The processor thus may access one or more input devices to obtain input data, and may access one or more output devices to communicate output data. The input and/or output devices may include one or more of the following: Random Access Memory (RAM), Redundant Array of Independent Disks (RAID), floppy drive, CD, DVD, magnetic disk, internal hard drive, external hard drive, memory stick, flash memory, solid state drive, or other storage device capable of being accessed by a processor as provided herein, where such aforementioned examples are not exhaustive, and are for illustration and not limitation.

The computer program(s) may be implemented using one or more high level procedural or object-oriented programming languages to communicate with a computer system; however, the program(s) may be implemented in assembly or machine language, if desired. The language may be compiled or interpreted.

As provided herein, the processor(s) may thus be embedded in one or more devices that may be operated independently or together in a networked environment, where the network may include, for example, a Local Area Network (LAN), wide area network (WAN), personal area network (PAN), and/or may include an intranet and/or the internet and/or another network. The network(s) may be wired or wireless or a combination thereof and may use one or more communications protocols to facilitate communications between the different processors. The processors may be configured for distributed processing and may utilize, in some embodiments, a client-server model as needed. Accordingly, the methods and systems may utilize multiple processors and/or processor devices, and the processor instructions may be divided amongst such single- or multiple-processor/devices.

The device(s) or computer systems that integrate with the processor(s) may include, for example, a personal computer(s), workstation(s) (e.g., Sun, HP), personal digital assistant(s) (PDA(s)), handheld device(s) such as cellular telephone(s) or smart cellphone(s), tablet(s), laptop(s), handheld computer(s), or another device(s) capable of being integrated with a processor(s) that may operate as provided herein. Accordingly, the devices provided herein are not exhaustive and are provided for illustration and not limitation.

References to “a microprocessor” and “a processor”, or “the microprocessor” and “the processor,” may be understood to include one or more microprocessors that may communicate in a stand-alone and/or a distributed environment(s), and may thus be configured to communicate via wired or wireless communications with other processors, where such one or more processor may be configured to operate on one or more processor-controlled devices that may be similar or different devices. Use of such “microprocessor” or “processor” terminology may thus also be understood to include a central processing unit, an arithmetic logic unit, an application-specific integrated circuit (IC), and/or a task engine, with such examples provided for illustration and not limitation.

Furthermore, references to memory, unless otherwise specified, may include one or more processor-readable and accessible memory elements and/or components that may be internal to the processor-controlled device, external to the processor-controlled device, and/or may be accessed via a wired or wireless network using a variety of communications protocols, and unless otherwise specified, may be arranged to include a combination of external and internal memory devices, where such memory may be contiguous and/or partitioned based on the application. Accordingly, references to a database may be understood to include one or more memory associations, where such references may include commercially available database products (e.g., SQL, Informix, Oracle) and also proprietary databases, and may also include other structures for associating memory such as links, queues, graphs, trees, with such structures provided for illustration and not limitation.

References to a network, unless provided otherwise, may include one or more intranets and/or the internet. References herein to microprocessor instructions or microprocessor-executable instructions, in accordance with the above, may be understood to include programmable hardware.

Unless otherwise stated, use of the word “substantially” may be construed to include a precise relationship, condition, arrangement, orientation, and/or other characteristic, and deviations thereof as understood by one of ordinary skill in the art, to the extent that such deviations do not materially affect the disclosed methods and systems.

Throughout the entirety of the present disclosure, use of the articles “a” and/or “an” and/or “the” to modify a noun may be understood to be used for convenience and to include one, or more than one, of the modified noun, unless otherwise specifically stated. The terms “comprising”, “including” and “having” are intended to be inclusive and mean that there may be additional elements other than the listed elements.

Elements, components, modules, and/or parts thereof that are described and/or otherwise portrayed through the figures to communicate with, be associated with, and/or be based on, something else, may be understood to so communicate, be associated with, and or be based on in a direct and/or indirect manner, unless otherwise stipulated herein.

Although the methods and systems have been described relative to a specific embodiment thereof, they are not so limited. Obviously many modifications and variations may become apparent in light of the above teachings. Many additional changes in the details, materials, and arrangement of parts, herein described and illustrated, may be made by those skilled in the art. 

What is claimed is:
 1. A method, comprising: receiving a packet at a first network device in a network; determining an optimal route for the packet to a neighbor network device in the network using a Source Routing Table (SRT), wherein the SRT includes an optimized routing table and a standard routing table; routing the packet to the neighbor network device using the optimal route; and maintaining the SRT, wherein maintaining the SRT comprises: determining whether a route in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops using a one-hop optimized route; when sending a test packet fails, canceling a maintaining process for the route; and when sending a test packet succeeds, resending the test packet directly to the neighbor network device with no intermediary hops a predetermined number of times at predetermined intervals, such that if the resending is successful each time, routing all future non-test packets to the neighbor network device using the one-hop optimized route.
 2. The method of claim 1, wherein the optimized routing table comprises a list of neighbor network devices that the first network device can route to directly, and wherein the standard routing table comprises a ZigBee source routing table.
 3. The method of claim 1, wherein maintaining the SRT comprises: determining whether a route in the SRT is one-hop optimized; when the route is determined to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops; when sending a test packet succeeds, canceling a maintaining process for the route; and when sending a test packet is not successful, setting the route as not one-hop optimized and routing all future non-test packets to the neighbor network device using the standard routing table of the SRT.
 4. The method of claim 1, wherein maintaining the SRT comprises: determining whether a route to or from a concentrator in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, determining whether the concentrator is in a neighbor table and whether a link quality of a link to the concentrator is good; when the concentrator is either not in a neighbor table or a link quality is not good, repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval; when the concentrator is either in a neighbor table or a link quality is good, sending a test packet directly to the concentrator with no intermediary hops; when sending a test packet is not successful, canceling a maintaining process for the route; and when sending a test packet is successful, sending again a predetermined number of times, and if all are successful, setting the route as one-hop optimized and routing all future non-test packets to the concentrator using the one-hop optimized routing table of the SRT.
 5. The method of claim 4, wherein when the route is determined to be one-hop optimized, and wherein a link quality is good, sending a predetermined number of test packets to or from the concentrator; when sending a test packet succeeds, canceling a maintaining process for the route; when sending a test packet is not successful, then setting the route as not one-hop optimized and routing all future non-test packets to or from the concentrator using the standard routing table of the SRT; and when the route is determined to be one-hop optimized and a link quality is not good, then repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval.
 6. A computer program product, stored on a non-transitory computer readable medium, including instructions of optimized routing in localized dense networks that, when executed on a processor in communication with the non-transitory computer readable medium, cause the processor to perform operations of: receiving a packet at a first network device in a network; determining an optimal route for the packet to a neighbor network device in the network using a Source Routing Table (SRT) wherein the SRT includes an optimized routing table and a standard routing table; routing the packet using the optimal route; and maintaining the SRT, by: determining whether a route in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops using a one-hop optimized route; when sending a test packet fails, canceling a maintaining process for the route; and when sending a test packet is successful, resending the test packet directly to the neighbor network device with no intermediary hops a predetermined number of times at predetermined intervals, such that if the resending is successful each time, routing all future non-test packets to the neighbor network device using the one-hop optimized route.
 7. The computer program product of claim 6, wherein the optimized routing table comprises a list of neighbor network devices that the first network device can route to directly, and wherein the standard routing table comprises a ZigBee source routing table.
 8. The computer program product of claim 6, wherein the instructions for maintaining the SRT cause the processor to perform further operations of: determining whether a route in the SRT is one-hop optimized; when the route is determined to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops; when sending a test packet succeeds, canceling a maintaining process for the route; and when sending a test packet is not successful, setting the route as not one-hop optimized and routing all future non-test packets to the neighbor network device using the standard routing table of the SRT.
 9. The computer program product of claim 6, wherein the instructions for maintaining the SRT cause the processor to perform further operations of: determining whether a route to or from a concentrator in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, determining whether the concentrator is in a neighbor table and whether a link quality of a link to the concentrator is good; when the concentrator is either not in a neighbor table or a link quality is not good, repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval; when the concentrator is either in a neighbor table or a link quality is good, sending a test packet directly to the concentrator with no intermediary hops; when sending a test packet is not successful, canceling a maintaining process for the route; and when sending a test packet is successful, sending again a predetermined number of times, and if all are successful, setting the route as one-hop optimized and routing all future non-test packets to the concentrator using the one-hop optimized routing table of the SRT.
 10. The computer program product of claim 9, wherein the instructions cause the processor to perform further operations of: when the route is determined to be one-hop optimized, and wherein a link quality is good, sending a predetermined number of test packets to or from the concentrator; when sending a test packet succeeds, canceling a maintaining process for the route; when sending a test packet is not successful, then setting the route as not one-hop optimized and routing all future non-test packets to or from the concentrator using the standard routing table of the SRT; and when the route is determined to be one-hop optimized and a link quality is not good, then repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval.
 11. A network device comprising: a memory; a processor; a communications interface; and an interconnection mechanism coupling the memory, the processor, and the communications interface; wherein the memory is encoded with an application to optimize routing in localized dense networks, that when performed on the processor, provides a process to optimize routing in localized dense networks, the process causing the network device to perform operations of: receiving a packet at a first network device in a network; determining an optimal route for the packet to a neighbor network device in the network using a Source Routing Table (SRT) wherein the SRT includes an optimized routing table and a standard routing table; routing the packet to the neighbor network device using the optimal route; and maintaining the SRT, wherein maintaining the SRT comprises: determining whether a route in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops using a one-hop optimized route; when sending a test packet fails, canceling a maintaining process for the route; and when sending a test packet is successful, resending the test packet directly to the neighbor network device with no intermediary hops a predetermined number of times at predetermined intervals, such that if the resending is successful each time, routing all future non-test packets to the neighbor network device using the one-hop optimized route.
 12. The network device of claim 11, wherein the optimized routing table comprises a list of neighbor network devices that the first network device can route to directly, and wherein the standard routing table comprises a ZigBee source routing table.
 13. The network device of claim 11, wherein maintaining the SRT comprises: determining whether a route in the SRT is one-hop optimized; when the route is determined to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops; when sending a test packet succeeds, canceling a maintaining process for the route; and when sending a test packet is not successful, setting the route as not one-hop optimized and routing all future non-test packets to the neighbor network device using the standard routing table of the SRT.
 14. The network device of claim 11, wherein maintaining the SRT comprises: determining whether a route to or from a concentrator in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, determining whether the concentrator is in a neighbor table and whether a link quality of a link to the concentrator is good; when the concentrator is either not in a neighbor table or a link quality is not good, repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval; when the concentrator is either in a neighbor table or a link quality is good, sending a test packet directly to the concentrator with no intermediary hops; when sending a test packet is not successful, canceling a maintaining process for the route; and when sending a test packet is successful, sending again a predetermined number of times, and if all are successful, setting the route as one-hop optimized and routing all future non-test packets to the concentrator using the one-hop optimized routing table of the SRT.
 15. The network device of claim 14, further comprising operations of: when the route is determined to be one-hop optimized, and wherein a link quality is good, sending a predetermined number of test packets to or from the concentrator; when sending a test packet succeeds, canceling a maintaining process for the route; when sending a test packet is not successful, then setting the route as not one-hop optimized and routing all future non-test packets to or from the concentrator using the standard routing table of the SRT; and when the route is determined to be one-hop optimized and a link quality is not good, then repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval. 